Independent transversal domination in graphs
نویسنده
چکیده
A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is adjacent to a vertex in S. A dominating set which intersects every maximum independent set in G is called an independent transversal dominating set. The minimum cardinality of an independent transversal dominating set is called the independent transversal domination number of G and is denoted by γit(G). In this paper we begin an investigation of this parameter.
منابع مشابه
Independent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملOn Graphs with Equal Chromatic Transversal Domination and Connected Domination Numbers
Let G = (V, E) be a graph with chromatic number χ(G). A dominating set D of G is called a chromatic transversal dominating set (ctd-set) if D intersects every color class of every χ-partition of G. The minimum cardinality of a ctd-set of G is called the chromatic transversal domination number of G and is denoted by γct(G). In this paper we characterize the class of trees, unicyclic graphs and c...
متن کاملOn independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملOn the total k-domination number of graphs
Let k be a positive integer and let G = (V,E) be a simple graph. The k-tuple domination number γ×k(G) of G is the minimum cardinality of a k-tuple dominating set S, a set that for every vertex v ∈ V , |NG[v]∩S| ≥ k. Also the total k-domination number γ×k,t(G) of G is the minimum cardinality of a total k -dominating set S, a set that for every vertex v ∈ V , |NG(v)∩S| ≥ k. The k-transversal numb...
متن کاملTotal domination of graphs and small transversals of hypergraphs
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n+4m)/21 vertices. In the particular case n = m, the transversal has at most 3n/7 vertices, and this bound is sharp in the complement of the Fano plane. Chvátal and McDiarmid [5] proved that every 3-uniform hypergraph with n vertices and edges has a transversal of siz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 32 شماره
صفحات -
تاریخ انتشار 2012